Explicit construction of exact unitary designs

نویسندگان

چکیده

The purpose of this paper is to give explicit constructions unitary $t$-designs in the group $U(d)$ for all $t$ and $d$. It seems that were so far known only very special cases. Here construction means entries matrices are given by values elementary functions at root some polynomials. We will discuss what best such $4$-designs $U(4)$ obtained these methods. Indeed we an inductive designs on compact groups using Gelfand pairs $(G,K)$. Note $(U(n),U(m) \times U(n-m))$ a pair. By zonal spherical $(G,K)$, can construct $G$ from $K$. remark our proofs use representation theory crucially. also method be applied orthogonal $O(d)$, thus provides another $d$ dimensional sphere $S^{d-1}$ induction

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Structure of exact and approximate unitary t-designs

When studying “random” operators it is essential to be able to integrate over the Haar measure, both analytically and algorithmically. Unitary t-designs provide a method to simplify integrating polynomials of degree less than t over U(d). In particular, by replacing averages over the Haar measure by averages over a finite set, they allow applications in algorithms. We provide three equivalent d...

متن کامل

Near-linear constructions of exact unitary 2-designs

A unitary 2-design can be viewed as a quantum analogue of a 2-universal hash function: it is indistinguishable from a truly random unitary by any procedure that queries it twice. We show that exact unitary 2-designs on n qubits can be implemented by quantum circuits consisting of Õ(n) elementary gates in logarithmic depth. This is essentially a quadratic improvement in size (and in width times ...

متن کامل

Unitary t-designs

Unitary t-designs provide a method to simplify integrating polynomials of degree less than t over U(d). We prove a classic result the trace double sum inequality and use it to derive the fundamental symmetries of t-designs. As an alternate approach to deriving an asymptotically tight lower bound on the size of t-designs, we introduce a greedy algorithm for constructing designs. Unfortunately, w...

متن کامل

Unitary designs and codes

A unitary design is a collection of unitary matrices that approximate the entire unitary group, much like a spherical design approximates the entire unit sphere. In this paper, we use irreducible representations of the unitary group to find a general lower bound on the size of a unitary t-design in U(d), for any d and t. We also introduce the notion of a unitary code — a subset of U(d) in which...

متن کامل

Implementing Unitary 2-Designs Using Random Diagonal-unitary Matrices

Unitary 2-designs are random unitary matrices which, in contrast to their Haar-distributed counterparts, have been shown to be efficiently realized by quantum circuits. Most notably, unitary 2-designs are known to achieve decoupling, a fundamental primitive of paramount importance in quantum Shannon theory. Here we prove that unitary 2-designs can be implemented approximately using random diago...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Mathematics

سال: 2022

ISSN: ['1857-8365', '1857-8438']

DOI: https://doi.org/10.1016/j.aim.2022.108457